A note on partially ordered tree automata

A note on partially ordered tree automata

A note on partially ordered generalized terms

In this paper we study the definition of generalized powerset of terms in the context of partially ordered monads. We provide a definition of the powerset of terms over acSLAT and study some possible directions for the definition of a partially ordered term monad.

A Note on Fuzzy Tree Automata

Chaudhari S. R. ,Komejwar D. D. , On Fuzzy Pushdown Automata and their covering , International Journal of Computer Applications Vol. 46(8),2012 pp 27-33 Comon H. ,Dauchet M. ,Gilleron R. ,Jacquemard F. , Lugiez D. ,Loding C. ,Tison S. , and Tommasi M. , Tree Automata: techniques and apllications. (2007) Lee E. T. Fuzzy tree automata and syntactic pattern recognition, IEEE Trans Pattern Anal Ma...

Partially Ordered Two-Way Büchi Automata

We introduce partially ordered two-way Büchi automata and characterize their expressive power in terms of fragments of first-order logic FO[<]. Partially ordered two-way Büchi automata are Büchi automata which can change the direction in which the input is processed with the constraint that whenever a state is left, it is never re-entered again. Nondeterministic partially ordered two-way Büchi ...

Automata for Partially Ordered and Partially Reliable Connections

We present a formal model for the speciication of a transport protocol with partially ordered and partially reliable data delivery. An abstract syntax is deened to specify order and reliability constraints in data ows, and is also used to specify the particular automata which recognise exactly the sets of deliverable streams. This new class of automata extends the Asynchronous Cellular Automata...